New results on nonsingular power LCM matrices
نویسندگان
چکیده
Let e and n be positive integers and S = {x1, . . . , xn} be a set of n distinct positive integers. The n × n matrix having eth power [xi, xj ] of the least common multiple of xi and xj as its (i, j)-entry is called the eth power least common multiple (LCM) matrix on S, denoted by ([S]). The set S is said to be gcd closed (respectively, lcm closed) if (xi, xj) ∈ S (respectively, [xi, xj ] ∈ S) for all 1 ≤ i, j ≤ n. In 2004, Shaofang Hong showed that the power LCM matrix ([S]) is nonsingular if S is a gcd-closed set such that each element of S holds no more than two distinct two prime factors. In this paper, this result is improved by showing that if S is a gcd-closed set such that every element of S contains at most two distinct prime factors or is of the form pqr with p, q and r being distinct primes and 1 ≤ l ≤ 4 being an integer, then except for the case that e = 1 and 270, 520, 810, 1040 ∈ S, the power LCM matrix ([S]) on S is nonsingular. This gives an evidence to a conjecture of Hong raised in 2002. For the lcm-closed case, similar results are established.
منابع مشابه
Ela New Results on Nonsingular Power Lcm Matrices
Let e and n be positive integers and S = {x1, . . . , xn} be a set of n distinct positive integers. The n × n matrix having eth power [xi, xj ] of the least common multiple of xi and xj as its (i, j)-entry is called the eth power least common multiple (LCM) matrix on S, denoted by ([S]). The set S is said to be gcd closed (respectively, lcm closed) if (xi, xj) ∈ S (respectively, [xi, xj ] ∈ S) ...
متن کاملAn analysis of GCD and LCM matrices via the LDL^T-factorization
Let S = {x1, x2, . . . , xn} be a set of distinct positive integers such that gcd(xi, xj) ∈ S for 1 ≤ i, j ≤ n. Such a set is called GCD-closed. In 1875/1876, H.J.S. Smith showed that, if the set S is “factor-closed”, then the determinant of the matrix eij = gcd(xi, xj) is det(E) = ∏n m=1 φ(xm), where φ denotes Euler’s Phi-function. Since the early 1990’s there has been a rebirth of interest in...
متن کاملEla an Analysis of Gcd and Lcm Matrices via the Ldl -factorization∗
Let S = {x1, x2, . . . , xn} be a set of distinct positive integers such that gcd(xi, xj) ∈ S for 1 ≤ i, j ≤ n. Such a set is called GCD-closed. In 1875/1876, H.J.S. Smith showed that, if the set S is “factor-closed”, then the determinant of the matrix eij = gcd(xi, xj) is det(E) = ∏n m=1 φ(xm), where φ denotes Euler’s Phi-function. Since the early 1990’s there has been a rebirth of interest in...
متن کاملDivisibilty Properties of Gcd Ve Lcm Matrices
Let a, b and n be positive integers and let S = {x1, x2, . . . , xn} be a set of distinct positive integers. The n × n matrix (Sf ) = (f ((xi, xj))), having f evaluated at the greatest common divisor (xi, xj) of xi and xj as its ij−entry, is called the GCD matrix associated with f on the set S. Similarly, the n × n matrix [Sf ] = (f ([xi, xj ])) is called the LCM matrix associated with f on S. ...
متن کاملThe lower bounds for the rank of matrices and some sufficient conditions for nonsingular matrices
The paper mainly discusses the lower bounds for the rank of matrices and sufficient conditions for nonsingular matrices. We first present a new estimation for [Formula: see text] ([Formula: see text] is an eigenvalue of a matrix) by using the partitioned matrices. By using this estimation and inequality theory, the new and more accurate estimations for the lower bounds for the rank are deduced....
متن کامل